A Hybridization of Simulated Annealing and Local PCA for Automatic Component Assignment Within ICA
نویسندگان
چکیده
Independent component analysis (ICA) as well as blind source separation (BSS) often faces the problem of assigning the independent or uncorrelated components estimated with ICA or BSS techniques to underlying source signals, artifacts or noise contributions. In this work an automatic assignment tool is presented which uses a priori knowledge about the form of some of the signals to be extracted. The algorithm is applied to the problem of removing water artifacts from 2D NOESY NMR spectra. The algorithm uses local PCA to approximate the water artifact and defines a suitable cost function which is optimized using simulated annealing. The blind source separation of the water artifact from the remaining protein spectrum is done with the recently developed algorithm dAMUSE.
منابع مشابه
Feature selection using genetic algorithm for classification of schizophrenia using fMRI data
In this paper we propose a new method for classification of subjects into schizophrenia and control groups using functional magnetic resonance imaging (fMRI) data. In the preprocessing step, the number of fMRI time points is reduced using principal component analysis (PCA). Then, independent component analysis (ICA) is used for further data analysis. It estimates independent components (ICs) of...
متن کاملA Continuous Review inventory Control Model within Batch Arrival Queuing Framework: A Parameter-Tuned Imperialist Competitive Algorithm
In this paper, a multi-product continues review inventory control problem within batch arrival queuing approach (MQr/M/1) is modeled to find the optimal quantities of maximum inventory. The objective function is to minimize summation of ordering, holding and shortage costs under warehouse space, service level, and expected lost-sales shortage cost constraints from retailer and warehouse viewpoi...
متن کاملLocal Pca Learning with Resolution-dependent Mixtures of Gaussians
A globally linear model, as implied by conventional Principal Component Analysis (PCA), may be insufficient to represent multivariate data in many situations. It has been known for some time that a combination of several "local" PCA’s can provide a suitable approach in such cases [1, 2]. An important question is then how to find an appropriate partitioning of the data space together with a prop...
متن کاملComparison of Acceptance Criteria in Randomized Local Searches
One key component of stochastic local search algorithms is the acceptance criterion that determines whether a solution is accepted as the new current solution or it is discarded. One of the most studied local search algorithms is simulated annealing. It often uses the Metropolis condition as acceptance criterion, which always accepts equal or better quality solutions and worse ones with a proba...
متن کاملA General Software Library for Parallel Simulated Annealing
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances of these problems or those with a lot of hard constraints even fast heuristics require a considerable amount of computational time. At the same time, especially for sensitivity analyses, fast response times are necessar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005